A Critical Note on Stable Model Semantics
نویسندگان
چکیده
In this paper, we argue that both the stable model semantics and its three-valued version are conceptually awed.
منابع مشابه
A critical study of Salafiyya`s view on the semantics of Divine attributes
This article has no abstract.
متن کاملYet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs
Recently, the stable model semantics was extended to a more general syntax beyond the rule form. Cabalar and Ferraris, as well as Cabalar, Pearce, and Valverde, showed that any propositional theory under the stable model semantics can be turned into a logic program. In this note, we present yet another proof of this result. Unlike the other approaches that are based on the logic of hereand-ther...
متن کاملA note on the uniqueness of stable marriage matching
In this note we present some sufficient conditions for the uniqueness of a stable matching in the Gale-Shapley marriage classical model of even size. We also state the result on the existence of exactly two stable matchings in the marriage problem of odd size with the same conditions.
متن کاملLogic Programs with Intensional Functions (Preliminary Report)
The stable model semantics treats a logic program as a mechanism for specifying its intensional predicates. In this note we discuss a modification of that semantics in which functions, rather than predicates, are intensional. The idea of the new definition comes from nonmonotonic causal logic.
متن کاملStable models for infinitary formulas with extensional atoms
The definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a distinction between intensional and extensional atoms. The symmetric splitting theorem for first-order formulas is then extended to infinitary formulas and used ...
متن کامل